On dependence and reliability computations
نویسندگان
چکیده
منابع مشابه
Boolean Normal Forms, Shellability, and Reliability Computations
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive normal forms are known for which orthogonalization can be efficiently performed. An interesting class with this property is the class of shellable disjunctive normal forms (DNFs). In this paper, we p...
متن کاملInterconnect reliability dependence on fast diffusivity paths
0026-2714/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.microrel.2011.09.035 ⇑ Corresponding author at: Christian Doppler Labor Microelectronics, Institute for Microelectronics, TU W E360, A-1040 Wien, Austria. Tel.: +43 1 58801 36032 E-mail address: [email protected] (H. Ceric). The reliability of interconnects in modern integrated circuits is determined by the magnitude and direc...
متن کاملPractical First-order Reliability Computations Using Spreadsheet
ABSRACT: A practical procedure for reliability analysis involving correlated nonnormals was described in Low & Tang (1997), using object-oriented constrained optimization in the ubiquitous spreadsheet platform. Numerical derivatives and iterative search for the design point were automatic. The objective of this paper is to further illustrate the 1997 procedure for two geotechnical problems with...
متن کاملStochastic Ageing and Dependence for Reliability
Ageing and dependence are two important characteristics in reliability and survival analysis, and they affect significantly the decision people make with regard to maintenance, repair/replacement, price setting, warranties, medical studies, and other areas. There are many papers published at different technical levels. This book aims at providing a state-of-the-art review of the subject so the ...
متن کاملSpi Computations on Grids Computations on Grids Computations on Grids
We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1991
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230210504